A new deterministic heuristic knots placement for B-Spline approximation

Knot Placement for B-Spline Curve Approximation

Curve approximation still remains one of the di cult problems in CAD and CAGD. One of the key questions in this area is to pick a reasonable number of points from the original curve which can be interpolated with a parametric curve. This paper highlights the use of arc length and curvature characteristics of the given curve to extract the interpolation points. An algorithm is also provided to h...

Using Simulated Annealing for knot placement for cubic spline approximation

In this paper, a new methodology is developed for knots placement for cubic spline approximation, using Simulated Annealing. It is not necessary to convert the problem into a discrete combinatorial optimization problem, as presented in other paradigms inspired in genetic algorithm or artificial immune systems, and therefore, removing the constrain of combinatorial optimization problem in the pr...

APPROXIMATION OF 3D-PARAMETRIC FUNCTIONS BY BICUBIC B-SPLINE FUNCTIONS

In this paper we propose a method to approximate a parametric 3 D-function by bicubic B-spline functions

Least Squares Cubic Spline Approximation I Fixed Knots

A direct method to solve optimal knots of B-spline curves: An application for non-uniform B-spline curves fitting

B-spline functions are widely used in many industrial applications such as computer graphic representations, computer aided design, computer aided manufacturing, computer numerical control, etc. Recently, there exist some demands, e.g. in reverse engineering (RE) area, to employ B-spline curves for non-trivial cases that include curves with discontinuous points, cusps or turning points from the...